Robust berth scheduling using machine learning for vessel arrival time prediction

نویسندگان

چکیده

Abstract In this work, the potentials of data-driven optimization for well-known berth allocation problem are studied. The aim robust scheduling is to derive conflict-free vessel assignments at quay a terminal, taking into account uncertainty regarding actual arrival times which may result from external influences as, e.g., cross wind and sea current. order achieve robustness, four different Machine Learning methods-from linear regression an artificial neural network-are employed time prediction in work. methods analysed evaluated with respect their forecast quality. calculation use so-called dynamic buffers (DTBs), derived AIS-based forecasts whose length depends on estimated reliability, model enhance robustness resulting schedules considerably, as shown extensive numerical study. Furthermore, results show that also rather simple approaches able reach high accuracy. does not only lead more solutions, but less waiting vessels hence enhanced service quality, can be by studying real data. Moreover, it turns out accuracy berthing schedules, measured deviation planned actually realisable exceeds all underlines usefulness DTB approach.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Real-time Scheduling of a Flexible Manufacturing System using a Two-phase Machine Learning Algorithm

The static and analytic scheduling approach is very difficult to follow and is not always applicable in real-time. Most of the scheduling algorithms are designed to be established in offline environment. However, we are challenged with three characteristics in real cases: First, problem data of jobs are not known in advance. Second, most of the shop’s parameters tend to be stochastic. Third, th...

متن کامل

Robust Scheduling for Berth Allocation and Quay Crane Assignment Problem

Decision makers must face the dynamism and uncertainty of real-world environments when they need to solve the scheduling problems. Different incidences or breakdowns, for example, initial data could change or some resources could become unavailable, may eventually cause the infeasibility of the obtained schedule. To overcome this issue, a robust model and a proactive approach are presented for ...

متن کامل

Comparison of Model Based and Machine Learning Approaches for Bus Arrival Time Prediction

3 The provision of accurate bus arrival information is critical to encourage more people to use 4 public transport and alleviate traffic congestion. Developing a prediction scheme for bus travel 5 times can provide such information. Prediction schemes can be data driven or may use a 6 mathematical model that is usually less data intensive. This paper compares the performance of 7 two methods – ...

متن کامل

Stock Price Prediction using Machine Learning and Swarm Intelligence

Background and Objectives: Stock price prediction has become one of the interesting and also challenging topics for researchers in the past few years. Due to the non-linear nature of the time-series data of the stock prices, mathematical modeling approaches usually fail to yield acceptable results. Therefore, machine learning methods can be a promising solution to this problem. Methods: In this...

متن کامل

Machine learning algorithms for time series in financial markets

This research is related to the usefulness of different machine learning methods in forecasting time series on financial markets. The main issue in this field is that economic managers and scientific society are still longing for more accurate forecasting algorithms. Fulfilling this request leads to an increase in forecasting quality and, therefore, more profitability and efficiency. In this pa...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Flexible Services and Manufacturing Journal

سال: 2022

ISSN: ['1936-6582', '1936-6590']

DOI: https://doi.org/10.1007/s10696-022-09462-x